Adjustability of a discrete particle swarm optimization for the dynamic TSP
نویسندگان
چکیده
منابع مشابه
Discrete Particle Swarm Optimization for TSP based on Neighborhood
Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal solutions for continuous optimization problems. Updating kinetic equations for particle swarm optimization algorithm are improved to solve traveling salesman problem (TSP) based on problem characteristics and discrete variable. Those strategies which are named heuristic factor, reversion mutant and adaptive no...
متن کاملParticle swarm optimization-based algorithms for TSP and generalized TSP
A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the pr...
متن کاملA Hybrid Particle Swarm Optimization and Genetic Algorithm for Truss Structures with Discrete Variables
A new hybrid algorithm of Particle Swarm Optimization and Genetic Algorithm (PSOGA) is presented to get the optimum design of truss structures with discrete design variables. The objective function chosen in this paper is the total weight of the truss structure, which depends on upper and lower bounds in the form of stress and displacement limits. The Particle Swarm Optimization basically model...
متن کاملSwarm-based approximate dynamic optimization process for discrete particle swarm optimization system
This paper presents a convergence analysis of particle swarm optimization system by treating it as a discrete-time linear time-variant system firstly. And then, based on the results of system convergence conditions, dynamic optimal control of a deterministic PSO system for parameters optimization is studied by using dynamic programming; and an approximate dynamic programming algorithm – swarm-b...
متن کاملParticle Swarm Optimization with Simulated Annealing for TSP
-Aiming at the shortcoming of basic PSO algorithm, that is, easily trapping into local minimum, we propose an advanced PSO algorithm with SA and apply this new algorithm for solving TSP problem. The core of algorithm is based on the PSO algorithm. SA method is used to slow down the degeneration of the PSO swarm and increase the swarm’s diversity. The comparative experiments were made between PS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2017
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-017-2738-9